Electronic Communications in Probability Constructions of a Brownian Path with a given Minimum
نویسنده
چکیده
We construct a Brownian path conditioned on its minimum value over a xed time interval by simple transformations of a Brownian bridge. Path transformations have proved useful in the study of Brownian motion and related processes , by providing simple constructions of various conditioned processes such as Brownian bridge, meander and excursion, starting from an unconditioned Brownian motion. As well as providing insight into the structure of these conditioned processes, path constructions assist in the computation of various conditional laws of Brownian functionals, and in the simulation of conditioned processes. Starting from a standard one-dimensional Brownian motion B = (B t) 0t1 with B 0 = 0, one well known construction of a Brownian bridge of length 1 from 0 to x, denoted B br;x , is the following: B br;x u := B u ? uB 1 + ux (0 u 1): (1) Then a Brownian meander of length 1 starting at 0 and conditioned to end at r 0, de
منابع مشابه
Constructions of a Brownian Path with a given Minimum
We construct a Brownian path conditioned on its minimum value over a fixed time interval by a simple transformation of a Brownian bridge. DOI: 10.1214/ECP.v4-1003 Posted at the Zurich Open Repository and Archive, University of Zurich ZORA URL: http://doi.org/10.5167/uzh-79487 Published Version Originally published at: Bertoin, Jean; Pitman, Jim; de Chavez, Juan Ruiz (1999). Constructions of a B...
متن کاملConvertible limited (multi-) verifier signature: new constructions and applications
A convertible limited (multi-) verifier signature (CL(M)VS) provides controlled verifiability and preserves the privacy of the signer. Furthermore, limited verifier(s) can designate the signature to a third party or convert it into a publicly verifiable signature upon necessity. In this proposal, we first present a generic construction of convertible limited verifier signature (CLVS) into which...
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملArrival probability in the stochastic networks with an established discrete time Markov chain
The probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. A discrete time Markov chain with an absorbing state is established in a directed acyclic network. Then, the probability of transition from the initial state to the absorbing state is computed. It is as...
متن کاملA New Approach to Approximate Completion Time Distribution Function of Stochastic Pert Networks
The classical PERT approach uses the path with the largest expected duration as the critical path to estimate the probability of completing a network by a given deadline. However, in general, such a path is not the most critical path (MCP) and does not have the smallest estimate for the probability of completion time. The main idea of this paper is derived from the domination structure between ...
متن کامل